发表于 | 更新于 | 分类于
本文字数： 242 | 阅读时长 ≈ 1 分钟

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0 ? Find all unique triplets in the array which gives the sum of zero.

$2+1=3$

Note:

The solution set must not contain duplicate triplets.

Example:
1
2